منابع مشابه
Rotation Sets and Almost Periodic Sequences
We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segments as well as non-convex and even plane-separating continua. This shows that restrictions which hold for rotation set on the whole torus are not valid on minimal sets. The proof uses a construction of rotational horseshoes by Kwapisz to transfer the ...
متن کاملForbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
Assume that for some α < 1 and for all nutural n a set Fn of at most 2 “forbidden” binary strings of length n is fixed. Then there exists an infinite binary sequence ω that does not have (long) forbidden substrings. We prove this combinatorial statement by translating it into a statement about Kolmogorov complexity and compare this proof with a combinatorial one based on Laslo Lovasz local lemm...
متن کاملAlmost periodic sequences with respect to orthogonal polynomials
Let (Rn(x))n∈N0 be an orthogonal sequence inducing a polynomial hypergroup on N0. The basic facts on polynomial hypergroups and their characters can be found in the monograph [1] or in the papers [6, 7]. A recent review is [8]. The Banach space of almost periodic functions on hypergroups is introduced and studied by the author in [5]. Weakly almost periodic functions are the topic of [12]. It i...
متن کاملAlmost Periodic Sequences and Functions with given Values
We present a method for constructing almost periodic sequences and functions with values in a metric space. Applying this method, we find almost periodic sequences and functions with prescribed values. Especially, for any totally bounded countable set X in a metric space, it is proved the existence of an almost periodic sequence {ψk}k∈Z such that {ψk; k ∈ Z} = X and ψk = ψk+lq(k), l ∈ Z for all...
متن کاملStrongly Almost Periodic Sequences under Finite Automata Mappings
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be interesting in connection with computer science. The paper studies the class of eventually strongly almost periodic sequences (i. e., becoming strongly almost peri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00847-2